On the Equivalence of Causal Models

نویسندگان

  • Tom S. Verma
  • Judea Pearl
چکیده

Scientists often use directed acyclic graphs (days) to model the qualitative structure of causal theories, allowing the parameters to be estimated from observational data. Two causal models are equivalent if there is no experiment which could distinguish one from the other. A canonical representation for causal models is presented which yields an efficient graphical criterion for deciding equivalence, and provides a theoretical basis for extracting causal structures from empirical data. This representation is then extended to the more general case of an embedded causal model, that is, a dag in which only a subset of the variables are observable. The canonical representation presented here yields an efficient algorithm for determining when two embedded causal models reflect the same dependency information. This algorithm leads to a model theoretic definition of causation in terms of statistical dependencies.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the semi-Markov Equivalence of Causal Models

The variability of structure in a finite Markov equivalence class of causally sufficient mod­ els represented by directed acyclic graphs has been fully characterized. Without causal suf­ ficiency, an infinite semi-Markov equivalence class of models has only been characterized by the fact that each model in the equiva­ lence class entails the same marginal statis­ tical dependencies. In this pap...

متن کامل

Bayesian Discovery of Linear Acyclic Causal Models

Methods for automated discovery of causal relationships from non-interventional data have received much attention recently. A widely used and well understood model family is given by linear acyclic causal models (recursive structural equation models). For Gaussian data both constraint-based methods (Spirtes et al., 1993; Pearl, 2000) (which output a single equivalence class) and Bayesian score-...

متن کامل

Measurement Error and Causal Discovery

Algorithms for causal discovery emerged in the early 1990s and have since proliferated [4, 10]. After directed acyclic graphical representations of causal structures (causal graphs) were connected to conditional independence relations (the Causal Markov Condition1 and dseparation2), graphical characterizations of Markov equivalence classes of causal graphs (patterns) soon followed, along with p...

متن کامل

Do-calculus when the True Graph Is Unknown

One of the basic tasks of causal discovery is to estimate the causal effect of some set of variables on another given a statistical data set. In this article we bridge the gap between causal structure discovery and the do-calculus by proposing a method for the identification of causal effects on the basis of arbitrary (equivalence) classes of semi-Markovian causal models. The approach uses a ge...

متن کامل

On the Relationship between Model Abstraction and Causality: Variance of Causal Ordering under Abstraction Operations

This paper examines the relationship between causal ordering and two temporal abstraction techniques, namely generation of mixed models from dynamic models and aggregation of nearly decomposable models. The paper defines two notions of causal equivalence between an original model and its abstraction or its elaboration. Then, it shows that when the constraint for a uniform temporal grain size fo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1304.1108  شماره 

صفحات  -

تاریخ انتشار 2013